Fast Mapping Method based on Matrix Approach For Elliptic Curve Cryptography

Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography

Authentication protocols are indispensable in wireless sensor networks. Commonly they are based on asymmetric cryptographic algorithms. In this paper we investigate all categories of finite fields suitable for elliptic curve cryptography on the ATmega128 microcontroller: Fp, F2d , and Fpd . It turns out that binary fields enable the most efficient implementations.

Fast Elliptic Curve Cryptography in OpenSSL

We present a 64-bit optimized implementation of the NIST and SECG-standardized elliptic curve P-224. Our implementation is fully integrated into OpenSSL 1.0.1: full TLS handshakes using a 1024-bit RSA certificate and ephemeral Elliptic Curve Diffie-Hellman key exchange over P-224 now run at twice the speed of standard OpenSSL, while atomic elliptic curve operations are up to 4 times faster. In ...

Fast and compact elliptic-curve cryptography

Elliptic curve cryptosystems have improved greatly in speed over the past few years. Here we outline a new elliptic curve signature and key agreement implementation which achieves record speeds while remaining relatively compact. For example, on Intel Sandy Bridge, a curve with about 2250 points produces a signature in just under 52k clock cycles, verifies in under 170k clock cycles, and comput...

Fast Elliptic-Curve Cryptography on the Cell Broadband Engine

This paper is the first to investigate the power of the Cell Broadband Engine for state-of-the-art public-key cryptography. We present a high-speed implementation of elliptic-curve Diffie-Hellman (ECDH) key exchange for this processor, which needs 777000 cycles on one Synergistic Processor Unit for a scalar multiplication on a 255-bit elliptic curve, including the costs for key verification and...

Elliptic Curve Cryptography on FPGAs